Expressing and detecting control flow properties of distributed computations

نویسندگان

  • Vijay K. Garg
  • Alexander I. Tomlinson
  • Eddy Fromentin
  • Michel Raynal
چکیده

Properties of distributed computations can be either on their global states or on their control ows. This paper addresses control ow properties. It rst presents a simple yet powerful logic for expressing general properties on control ows, seen as sequences of local states. Among other properties, we can express invariance, sequential properties (to satisfy such a property a control ow must match a pattern described as a word on some alphabet) and non-sequential properties (these properties are on several control ows at the same time). A decentralized detection algorithm for properties described by this logic is then presented. This algorithm, surprisingly simple despite the power of the logic, observes the underlying distributed computation, does not alter its control ows and uses message tags to carry detection-related information. Expression et d etection de propri et es sur les ots de contr^ ole d'une ex ecution r epartie R esum e : Les propri et es d'une ex ecution r epartie peuvent ^ etre exprim ees sur ses etats globaux ou bien sur ses ots de contr^ ole. Nous nous int eressons dans ce rapport aux propri et es sur les ots de contr^ ole. Dans un premier temps, est pr esent ee une logique simple (quoique puissante) permettant d'exprimer des propri et es sur les ots de contr^ ole vus comme des s equences d' etats locaux. Au moyen de cette logique, nous pouvons notamment exprimer des propri et es telles l'invariance, les propri et es s equentielles (un ot de contr^ ole satisfait une propri et e s equentielle si et seulement si il peut ^ etre mis en correspondance avec un motif d ecrit comme un mot sur un alphabet) et les propri et es non s equentielles (ces propri et es ne consid erent pas qu'un seul ot de contr^ ole au m^ eme instant). Nous pr esentons ensuite un algorithme d ecentralis e permettant la d etection de toute propri et e d ecrite au moyen de cette logique. Cet algorithme, bien que simple en d epit de sa puissance d'expression, observe l'ex ecution r epartie sous-jacente en en pr eservant les ots de contr^ ole (les informations n ecessaire a la d etection sont transmises dans les messages de l'application).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Expressing and Detecting General Control Flow Properties of Distributed Computations

Properties of distributed computations can be either on their global states or on their control ows. This paper addresses control ow properties. It rst presents a simple yet powerful logic for expressing general properties on control ows, seen as sequences of local states. Among other properties, we can express invariance, sequential properties (to satisfy such a property a control ow must matc...

متن کامل

A Direct Matrix Inversion-Less Analysis for Distribution System Power Flow Considering Distributed Generation

This paper presents a new direct matrix inversion-less analysis for radial distribution systems (RDSs). The method can successfully deal with weakly meshed distribution systems. (WMDSs). Being easy to implement, direct methods (DMs) provide an excellent performance. Matrix inversion is the mean reason of divergence and low-efficiency in power flow algorithms. In this paper, the performance of t...

متن کامل

Partial Observation in Distributed Supervisory Control of Discrete-Event Systems

Distributed supervisory control is a method to synthesize local controllers in discrete-eventsystems with a systematic observation of the plant. Some works were reported on extending this methodby which local controllers are constructed so that observation properties are preserved from monolithic todistributed supervisory control, in an up-down approach. In this paper, we find circumstances in ...

متن کامل

The Reconstruction of a Mobile Agent Computation and Its Validation

We propose a new representation to describe mobile agents computations, where the underlying control structures are diffusing computations. Usually, distributed computations are abstracted as sets of receiving, sending and internal events. Instead of using this representation, we consider a diffusing computation as a set of leaves of a control tree associated to the different threads of control...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995